Configuring Random Graph Models with Fixed Degree Sequences
نویسندگان
چکیده
منابع مشابه
Configuring Random Graph Models with Fixed Degree Sequences
Random graph null models have found widespread application in diverse research communities analyzing network datasets, including social, information, and economic networks, as well as food webs, protein-protein interactions, and neuronal networks. The most popular family of random graph null models, called configuration models, are defined as uniform distributions over a space of graphs with a ...
متن کاملLink and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences.
The simplest null models for networks, used to distinguish significant features of a particular network from a priori expected features, are random ensembles with the degree sequence fixed by the specific network of interest. These "fixed degree sequence" (FDS) ensembles are, however, famously resistant to analytic attack. In this paper we introduce ensembles with partially-fixed degree sequenc...
متن کاملRandom Graphs with a Fixed Degree Sequence
Classical Ramsey-theoretic questions on graphs involve coloring the edges of a graph with a fixed number of colors, say k, and determining whether a given monochromatic subgraph exists [13]. Anti-Ramsey questions, on the other hand, consider other restrictions on the colorings (for example, using each color at most b times [17]), and search for subgraphs in which no color is repeated [10]. An e...
متن کاملQuasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملThe degree sequence of a random graph. I. The models
We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand we consider the distribution of degree sequences of random graphs with n vertices and 1 2 m edges. For a wide range of values of m, this distribution is almost everywhere in close correspondence wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 2018
ISSN: 0036-1445,1095-7200
DOI: 10.1137/16m1087175